Verification by Testing for Recursive Program Schemes
نویسندگان
چکیده
In this paper, we explore the testing-verification relationship with the objective of mechanizing the generation of test data. We consider program classes defined as recursive program schemes and we show that complete and finite test data sets can be associated with such classes, that is to say that these test data sets allow us to distinguish every two different functions in these schemes. This technique is applied to the verification of simple properties of programs.
منابع مشابه
Verifying Recursive Programs Using Intraprocedural Analyzers
Recursion can complicate program analysis significantly. Some program analyzers simply ignore recursion or even refuse to check recursive programs. In this paper, we propose an algorithm that uses a recursion-free program analyzer as a black box to check recursive programs. With extended program constructs for assumptions, assertions, and nondeterministic values, our algorithm computes function...
متن کاملcient Call by value Evaluation Strategy of Primitive Recursive Program Schemes
We consider primitive recursive program schemes with parameters together with the call by value computation rule The schemes are nite systems of functions which are de ned by primitive or structural recursion simultaneous recursion and nesting of function calls is allowed We present a transformation strategy which replaces primitive recursion by iteration The transformation strategy which is fu...
متن کاملInduction of Recursive Program Schemes
In this paper we present an approach to the induction of re-cursive structures from examples which is based on the notion of recursive program schemes. We separate induction from examples in two stages: (1) constructing initial programs from examples and (2) folding initial programs to recursive program schemes. By this separation, the induction of recursive program schemes can be reduced to a ...
متن کاملModel Checking and Functional Program Transformations
We study a model for recursive functional programs called higher order recursion schemes (HORS). We give new proofs of two verification related problems: reflection and selection for HORS. The previous proofs are based on the equivalence between HORS and collapsible pushdown automata and they lose the structure of the initial program. The constructions presented here are based on shape preservi...
متن کاملA Practical Approach to Verification of Recursive Programs in Theorema extended abstract
We report work in progress concerning the theoretical basis and the implementation in the Theorema system of a methodology for the generation of verification conditions for recursive procedures, with the aim of practical verification of recursive programs. Proving total correctness is achieved by proving separately partial correctness and then termination. We develop a pattern for proving parti...
متن کامل